Non-bounding constructions

Bounding non-GL2 and R.E.A

We prove that every degree a bounding some non-GL2 degree is recursively enumerable in and above (r.e.a.) some 1-generic de-

Two-Level Fingerprinting Codes: Non-Trivial Constructions

We extend the concept of two-level fingerprinting codes, introduced by Anthapadmanabhan and Barg (2009) in context of traceability (TA) codes [1], to other types of fingerprinting codes, namely identifiable parent property (IPP) codes, secure-frameproof (SFP) codes, and frameproof (FP) codes. We define and propose the first explicit non-trivial construction for two-level IPP, SFP and FP codes.

Non-Perturbative effects from orbifold constructions

We indicate how consistent heterotic orbifold compactifications, including non perturbative information, can be constructed. We first analyse the situation in six dimensions, N = 1, where strong coupling effects, implying the presence of five branes, are better known. We show that anomaly free models can be obtained even the usual modular invariance constraints are not satisfied. The perturbati...

Functional Projections in Finnish Non-Finite Constructions

It is an open question whether the functional projections above the VP projection are the same, either across languages or within a single language. Based on the morphosyntactic evidence in Finnish, and following Baker’s (1985) Mirror Principle, the functional projections of the non-finite clause differ from those of the finite clause, although both types of clauses contain a VP projection. Thi...

Some constructions of supermagic non-regular graphs